منابع مشابه
Online Portfolio Selection with Group Sparsity
In portfolio selection, it often might be preferable to focus on a few top performing industries/sectors to beat the market. These top performing sectors however might change over time. In this paper, we propose an online portfolio selection algorithm that can take advantage of sector information through the use of a group sparsity inducing regularizer while making lazy updates to the portfolio...
متن کاملAdaptive Bayesian Optimisation for Online Portfolio Selection
We present a Bayesian approach for online portfolio selection, a fundamental problem in computational finance. We pose the problem as the global optimisation of an expensive, time-varying, black-box function. As the optimum is itself dynamic, we use a model that allows us to capture time-dependent patterns of the function and to provide sequential decision processes that enable us to select opt...
متن کاملDesigning a Portfolio of Parameter Configurations for Online Algorithm Selection
Algorithm portfolios seek to determine an effective set of algorithms that can be used within an algorithm selection framework to solve problems. A limited number of these portfolio studies focus on generating different versions of a target algorithm using different parameter configurations. In this paper, we employ a Design of Experiments (DOE) approach to determine a promising range of values...
متن کاملOnline Lazy Updates for Portfolio Selection with Transaction Costs
A major challenge for stochastic optimization is the cost of updating model parameters especially when the number of parameters is large. Updating parameters frequently can prove to be computationally or monetarily expensive. In this paper, we introduce an efficient primal-dual based online algorithm that performs lazy updates to the parameter vector and show that its performance is competitive...
متن کاملRobust and Adaptive Algorithms for Online Portfolio Selection
We present an online approach to portfolio selection. The motivation is within the context of algorithmic trading, which demands fast and recursive updates of portfolio allocations, as new data arrives. In particular, we look at two online algorithms: Robust-Exponentially Weighted Least Squares (R-EWRLS) and a regularized Online minimum Variance algorithm (O-VAR). Our methods use simple ideas f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Financial Markets and Derivatives
سال: 2011
ISSN: 1756-7130,1756-7149
DOI: 10.1504/ijfmd.2011.038530